Method, apparatus and system for transmitting information bits

ABSTRACT

A method, an apparatus, and a system for transmitting information bits, where the method for transmitting information bits includes: dividing the information bits to be transmitted into at least two groups; encoding the information bits to be transmitted in each group; modulating the coded bits obtained by the encoding to obtain modulation symbols, in which each modulation symbol is obtained by using the modulation of the coded bits in the same group; and mapping and transmitting the modulation symbols. In this way, the receiving end easily reduces the algorithm complexity, thereby ensuring the performance of the receiving end.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of International Application No.PCT/CN2011/072364, filed on Mar. 31, 2011, which claims priority toChinese Patent Application No. 201010283778.X, filed on Sep. 8, 2010,both of which are hereby incorporated by reference in their entireties.

FIELD OF THE INVENTION

The present invention relates to the field of communicationstechnologies, and in particular, to a method, an apparatus and a systemfor transmitting information bits.

BACKGROUND OF THE INVENTION

In a Long Term Evolution Advanced (LTE-A) system, an uplink physicalchannel includes: a Physical Uplink Shared Channel (PUSCH) and aPhysical Uplink Control Channel (PUCCH). Generally, uplink controlsignaling is transmitted over the PUCCH, and mainly includes: ChannelQuality Indicator (CQI) signaling, an Acknowledged/non-acknowledged(ACK/NACK) message and a Scheduling Request Indicator (SRI) message.

Specially, a transmission format (or a carrier) of the uplink ACK/NACKmessage on the PUCCH in the LTE-A system applies a transmission formatbased on Discrete Fourier Transform (DFT)-Spreading-Orthogonal FrequencyDivision Multiplex (OFDM), and an example of the format is shown inFIG. 1. The format occupies 12 sub-carriers in one Physical ResourceBlock (PRB) defined by the 3rd Generation Partnership Project (3GPP)LTE/LTE-A in one slot, each sub-carrier indirectly corresponds to aQuaternary Phase Shift Keying (QPSK) modulation symbol, and each QPSKmodulation symbol carries two bits, and accordingly one slot needs tocarry 12*2=24 bits in total, and thus the entire DFT-S-OFDM format needsto carry 24 QPSK modulation symbols, that is, 48 bits, in two slots.

The specific main process of transmitting the information bits by usingthe PUCCH format based on DFT-S-OFDM is as follows: as shown in FIG. 1,first, a transmitting end encodes the information bits to be transmittedthrough a certain channel encoding manner to generate a sequence of 48coded bits [b₀, b₁, . . . , b₄₇], and then the 48 coded bits arescrambled, the 48 coded bits output after scrambling are modulatedthrough the QPSK to obtain a sequence of 24 QPSK symbols [q₀, q₁, . . ., q₂₃], and then 12-point DFT is performed on the first 12 symbols ofthe 24 modulation symbols [q₀, q₁, . . . , q₁₁], the 12 data symbols[Q₀, Q₁, . . . , Q₁₁] output after the DFT are sequentially mapped ontothe 12 sub-carriers of the first slot 0, in which the sequential mappingrefers to that adjacent modulation symbols in the modulation symbolsequence are mapped onto adjacent sub-carriers, and afterwards, the datasymbol on each sub-carrier is extended into five data symbols through acertain sequence [w₀, w₁, . . . , w₄] of length 5, and the data symbolsare mapped into a location for the data symbols in the time domain;likewise, the last 12 QPSK modulation symbols [Q₁₂, Q₁₃, . . . , Q₂₃]are mapped onto the second slot 1; and finally, a corresponding pilot isput on the preset pilot location and is transmitted. The processdescribed above also has other equivalent implementation methods. Forexample, the obtained 24 modulation symbols are extended first, and thenthe DFT is performed on the modulation symbols mapped on each timedomain symbol, and finally, the modulation symbols are mapped onto thephysical channel for transmission.

It is assumed that, in the 48 coded bits generated by encoding theinformation bits to be transmitted, the first 24 coded bits b(0), b(1),. . . , b(23) and the last 24 coded bits b(24), b(25), . . . , b(47) areindependently obtained. Accordingly, when a structure similar toDFT-S-OFDM is used, the modulation symbols corresponding to the first 24coded bits are sequentially mapped onto the slot 0, and the last 24coded bits are sequentially mapped onto the slot 1. In this way, thereceiving of the first 24 coded bits merely depends on the channelcondition of the slot 0. However, the channel condition of the slot 0may be good or bad, and thus the receiving performance is not stable.Likewise, the receiving of the last 24 coded bits merely depends on thechannel condition of the slot 1. Moreover, as shown in FIG. 1, the lastsymbol in the slot 1 may be occupied for other use sometimes, forexample, the last symbol is used to transmit a Sounding Reference Signal(SRS) sometimes, and when such a case occurs, the extension length inthe slot 1 of the DFT-S-OFDM format is shortened from the length 5 to alength 4. The performance of long extension length is better than theshort one. As such, if the first 24 coded bits are merely mapped ontothe slot 0, and the last 24 coded bits are merely mapped onto the slot1, the receiving performance of the first 24 coded bits is better thanthe receiving performance of the last 24 coded bits on the whole,thereby causing unbalanced receiving performance, and requiring a rathercomplex algorithm of the receiver.

SUMMARY OF THE INVENTION

Accordingly, the embodiments of the present invention provide a method,an apparatus and a system for transmitting information bits.

To achieve the above objectives, an embodiment of the present inventionadopts the following technical solution:

A method for transmitting information bits is provided, which includes:dividing information bits to be transmitted into at least two groups;encoding the information bits to be transmitted in each group;modulating coded bits obtained by encoding to obtain modulation symbols,in which each modulation symbol is obtained by modulating the coded bitsin a same group; and mapping and transmitting the modulation symbols.

To achieve the above objectives, an embodiment of the present inventionadopts the following technical solution: An apparatus for transmittinginformation bits is provided, which includes: a grouping unit,configured to divide information bits to be transmitted into at leasttwo groups; an encoding unit, configured to encode the information bitsto be transmitted in each group; a modulating unit, configured tomodulate coded bits obtained by encoding to obtain modulation symbols,in which each modulation symbol is obtained by modulating the coded bitsin a same group, and a mapping and transmitting unit, configured to mapand transmit the modulation symbols.

To achieve the above objectives, an embodiment of the present inventionadopts the following technical solution: A system for transmittinginformation bits is provided, which includes a terminal and a basestation in communication with the terminal, in which, the terminal isconfigured to divide information bits to be transmitted into at leasttwo groups, encode the information bits to be transmitted in each group,modulate coded bits obtained by encoding to obtain modulation symbols,in which each modulation symbol is obtained by modulating the coded bitsin a same group, and map the modulation symbols and transmit themodulation symbols to the base station; and the base station isconfigured to receive the modulation symbols transmitted by theterminal, and demodulate and decode the modulation symbols to obtain theinformation bits to be transmitted.

To achieve the above objectives, an embodiment of the present inventionadopts the following technical solution: A method for transmittinginformation bits is provided, which includes: dividing information bitsto be transmitted into at least two groups; encoding the informationbits to be transmitted in each group to obtain at least two groups ofcoded bits; combining the at least two groups of coded bit obtained bythe encoding to obtain a total coded bits sequence, in which, the totalcoded bits sequence is obtained by dividing the coded bits in each groupinto N sub-groups and reordering the sub-groups of the coded bit in eachgroup, and the sub-groups in at least one group of the coded bits arediscontinuously distributed in the total coded bit sequence afterreordering; modulating the total coded bits sequence to obtainmodulation symbols, in which each modulation symbol is obtained by usingthe modulation of the coded bits in the same group; and mapping andtransmitting the modulation symbols.

To achieve the above objectives, an embodiment of the present inventionadopts the following technical solution: An apparatus for transmittinginformation bits is provided, which includes: a grouping unit,configured to divide information bits to be transmitted into at leasttwo groups; an encoding unit, configured to encode the information bitsto be transmitted in each group divided by the grouping unit to obtainat least two groups of coded bit; a combining unit, configured tocombine the at least two groups of coded bits obtained by using theencoding of the encoding unit to obtain a total coded bits sequence, inwhich, the total coded bits sequence is obtained by dividing the encodedcoded bit in each group into N sub-groups and reordering the sub-groupsof the coded bits in each group, and the sub-groups in at least onegroup of the coded bits are discontinuously distributed in the totalcoded bit sequence after reordering; a modulating unit, configured tomodulate the total coded bit sequence obtained by the combining unit toobtain modulation symbols, in which each modulation symbol is obtainedby using the modulation of the coded bits in the same group; and amapping and transmitting unit, configured to map and transmit themodulation symbols obtained by the modulating unit.

To achieve the above objectives, an embodiment of the present inventionadopts the following technical solution: A method for transmittinginformation bits is provided, which includes: dividing information bitsto be transmitted into at least two groups; encoding the informationbits to be transmitted in each group; modulating the coded bits obtainedby the encoding of each group to obtain modulation symbols of eachgroup; combining the modulation symbols of each group to obtain amodulation symbol sequence; reordering the modulation symbol sequence,so that at least one group of the modulation symbols is discretelydistributed in the modulation symbol sequence; and mapping andtransmitting the modulation symbols.

To achieve the above objectives, an embodiment of the present inventionadopts the following technical solution: An apparatus for transmittinginformation bits, which includes: a grouping unit, configured to divideinformation bits to be transmitted into at least two groups; an encodingunit, configured to encode the information bits to be transmitted ineach group divided by the grouping unit; a modulating unit, configuredto modulate the coded bits encoded by the encoding unit to obtainmodulation symbols of each group; a combining unit, configured tocombine the modulation symbols of each group modulated by the modulatingunit to obtain a modulation symbol sequence; an ordering unit,configured to reorder the modulation symbol sequence obtained throughthe combining of the combining unit, so that at least one group of themodulation symbols is discretely distributed in the modulation symbolsequence; and a mapping and transmitting unit, configured to map andtransmit the modulation symbols reordered by the ordering unit.

To achieve the above objectives, an embodiment of the present inventionadopts the following technical solution: A method for transmittinginformation bits, which includes: dividing information bits to betransmitted into n groups, in which n is an integer greater than 1;encoding the information bits to be transmitted in each group to obtaincoded bits sequences of the n groups; dividing the coded bits sequenceof each group into N sub-groups, and reordering the sub-groups in eachgroup of the coded bits, so that each group of the coded bits isdiscretely distributed in the total coded bits sequence; modulating thetotal coded bits sequence to obtain modulation symbols; and mapping andtransmitting the modulation symbols.

To achieve the above objectives, an embodiment of the present inventionadopts the following technical solution. An apparatus for transmittinginformation bits, which includes: a grouping unit, configured to dividethe information bits to be transmitted into n groups, in which n is aninteger greater than 1; an encoding unit, configured to encode theinformation bits to be transmitted in each group divided by the groupingunit to obtain coded bits sequences of the n groups; an ordering unit,configured to divide the coded bits sequence of each group obtained bythe encoding unit into N sub-groups, and reorder the sub-groups in eachgroup of the coded bits, so that each group of the coded bits isdiscretely distributed in the total coded bits sequence; a modulatingunit, configured to modulate the total coded bits sequence reordered bythe ordering unit to obtain modulation symbols; and a mapping andtransmitting unit, configured to map and transmit the modulation symbolsobtained by the modulating unit.

In the embodiments of the present invention, the terminal divides theinformation bits to be transmitted into at least two groups, and encodesthe information bits to be transmitted in each group and modulates theencoded coded bits to obtain modulation symbols, in which eachmodulation symbol is obtained by using the modulation of the coded bitsin the same group. Because the terminal first divides the informationbits to be transmitted into at least two groups, and each modulationsymbol after encoding and modulation is obtained by using the coded bitsin the same group, a receiving end may easily reduce the algorithmcomplexity, thereby ensuring the performance of the receiving end.

BRIEF DESCRIPTION OF THE DRAWINGS

To illustrate the technical solutions according to the embodiments ofthe present invention or in the prior art more clearly, the accompanyingdrawings for describing the embodiments or the prior art are describedbriefly in the following. Apparently, the accompanying drawings in thefollowing description are only some embodiments of the presentinvention, and persons of ordinary skill in the art can derive otherdrawings from the accompanying drawings without creative efforts.

FIG. 1 is a schematic architectural view of transmission of informationbits by using a PUCCH format based on DFT-S-OFDM in the prior art;

FIG. 2 is a flowchart of a method for transmitting information bitsaccording to an embodiment of the present invention;

FIG. 3 is a flowchart of another method for transmitting informationbits according to an embodiment of the present invention;

FIG. 4 is a schematic diagram of a simulation result in the case thatthe number of information bits to be transmitted is 12 bits, 16 bits,and 20 bits according to an embodiment of the present invention;

FIG. 5 is a flowchart of still another method for transmittinginformation bits according to an embodiment of the present invention;

FIG. 6 is a schematic diagram of a simulation result in the case thatthe number of information bits to be transmitted is 12 bits, 16 bits,and 20 bits according to an embodiment of the present invention;

FIG. 7 is a schematic diagram of an apparatus for transmittinginformation bits according to an embodiment of the present invention;

FIG. 8 is a schematic structural view of a modulating unit according toan embodiment of the present invention; and

FIG. 9 is another schematic structural view of a modulating unitaccording to an embodiment of the present invention.

DETAILED DESCRIPTION OF THE EMBODIMENT

The technical solutions of the present invention are clearly describedin the following with reference to the accompanying drawings. It isobvious that the embodiments to be described are only a part rather thanall of the embodiments of the present invention. All other embodimentsobtained by persons skilled in the art based on the embodiments of thepresent invention without creative efforts shall fall within theprotection scope of the present invention.

An embodiment of the present invention provides a method fortransmitting information bits, and as shown in FIG. 2, the methodincludes the following steps:

Step 201: Divide the information bits to be transmitted into at leasttwo groups.

In step 201, a terminal divides the information bits to be transmittedinto at least two groups, that is, two or more groups. Each group mayhave a same or different number of information bits. In addition, theinformation bits to be transmitted include at least one of the followinguplink control information bits: a CQI, a Precoding Matrix Index (PMI),a Rank Indicator (RI), ACK/NACK information and an SRI.

Step 202: Encode the information bits to be transmitted in each group.

Step 203: Modulate the coded bits obtained by encoding step to obtainmodulation symbols, in which each modulation symbol is obtained by usingthe modulation of the coded bits in a same group.

The modulating the coded bits obtained by the encoding step to obtainthe modulation symbols specifically includes the following two manners.

The first manner is as follows: dividing the coded bits obtained by theencoding step in each group into N sub-groups to obtain a coded, bitsub-group sequence of each group; combining the coded bits sub-groupsequence of each group to obtain a total coded bits sub-group sequence;reordering the total coded bits sub-group sequence, so that the codedbits sub-group sequence of at least one group is discontinuouslydistributed in the total coded bits sub-group sequence; and modulatingthe reordered total coded bits sub-group sequence to obtain themodulation symbols. In addition, the reordering the total coded bitssub-group sequence, in order that the coded bits sub-group sequence ofat least one group is discontinuously distributed in the total codedbits sub-group sequence, which includes: alternately ordering the codedbits sub-group sequence of each group in the total coded bit sub-groupsequence.

The second manner is as follows: the modulating of all the coded bitsafter respective encoding to obtain a modulation symbol sequencespecifically includes: modulating the coded bits of each group obtainedby the encoding step to obtain the modulation symbols of each group;combining the modulation symbols of each group to obtain a modulationsymbol sequence; and reordering the modulation symbol sequence, so thatat least one group of the modulation symbols is discontinuouslydistributed in the modulation symbol sequence. In addition, thereordering of the modulation symbol sequence to enable at least onegroup of the modulation symbols to be discontinuously distributed in themodulation symbol sequence specifically includes: alternately orderingthe modulation symbols of each group in the modulation symbol sequence.

Step 204: Map and transmit the modulation symbols.

The terminal divides the information bits to be transmitted into atleast two groups, and encodes the information bits to be transmitted ineach group and modulates the coded bits obtained by encoding step toobtain modulation symbols, in which each modulation symbol is obtainedby using the modulation of the coded bits in the same group. Because theterminal first divides the information bits to be transmitted into atleast two groups, and each modulation symbol after encoding andmodulation is obtained by using the coded bits in the same group, areceiving end may easily reduce the algorithm complexity, therebyensuring the performance of the receiving end.

An embodiment of the present invention provides a method fortransmitting information bits, and as shown in FIG. 3, the methodincludes the following steps:

Step 301: A transmitting end first divides A information bits to betransmitted into n groups (n≧2), in which each group includes X(n) bits,and X(1)+X(2)+ . . . +X(n)=A.

Each group may have a same or different number of bits in this step. Forexample, 20 information bits are to be transmitted, which may be dividedinto two parts each having 10 bits, that is, X(1)=X(2)=10. Specifically,the transmitting end may be LTE/LTE-A user equipment (UE), and theinformation bits to be transmitted are uplink control information bitswhich include but are not limited to a CQI and/or a PMI and/or ACK/NACKinformation and/or an SRI.

In this step, dividing A information bits may also include the followingsub-steps. When the A information bits include control information bitsof different types, the A information bits may be grouped by the typesof the control information, that is, the bits of different types may beput in different groups. Because the receiving performance required bythe control information bits of different types is not totally the same,the control information bits of different types may be separatelyencoded. For example, the CQI information bits in the A information bitsare put in one group, and the ACK/NACK information is put in anothergroup; or the SRI information bits in the A information bits are put inone group, and the ACK/NACK information is put in another group; or theCQI information bits in the A information bits are put in one group, andthe SRI information is put in another group. Specifically, for example,if 16 information bits include 10 CQI bits and 6 ACK/NACK bits, the 10CQI bits are defined as one group, and the 6 ACK/NACK bits are definedas another group.

In this step, the dividing A information bits may also include thefollowing sub-steps. When the A information bits include a plurality ofcarrier CQIs, the A information bits may be grouped by carriers, thatis, the CQIs of different carriers may be put in different groups. Forexample, if 17 information bits include 11 CQI bits of the carrier 1 and6 CQI bits of the carrier 2, the 11 CQI bits of the carrier 1 are put inone group, and the 6 CQI bits of the carrier 2 are put in another group.

In this step, the dividing A information bits may also include thefollowing sub-steps. When the A information bits include the CQI, theACK/NACK and the SRI, the information bits corresponding to the ACK/NACKand the SRI are put in one group, the information bits corresponding tothe CQI are put in another group; or the information bits correspondingto the CQI and the SRI are put in one group, and the information bitscorresponding to the ACK/NACK are put in another group. For example, if18 information bits include 11 CQI bits, 6 ACK/NACK information bits and1 SRI information bit, the 11 CQI bits are put in one group, and the 6ACK/NACK information bits and the 1 SRI information bit are put inanother group.

Step 302: Encode the X(k) bits by using an encoding method k to generateU(k) coded bit sequences, in which U(1)+U(2)+ . . . +U(n)=B, B is thetotal number of coded bits, and U(k) is an integral multiple of thenumber of bits that is represented by one modulation symbol in apredetermined modulation manner.

Whether the encoding methods i, j are the same is not limited, forexample, if the modulation manner is predetermined to be QPSKmodulation, the number of bits included in each U(k) is a multiple of 2;if the modulation manner is predetermined to be 16-Quadrature AmplitudeModulation (16QAM), the number of bits included in each U(k) is amultiple of 4; and so forth. Specifically, when the DFT-S-OFDMillustrated in FIG. 1 is used, X(1) and X(2) each need to be encoded togenerate 24 coded bits sequences, that is, U(1)=U(2)=24 and B=48, andthe specific encoding methods may be to generate a coded bits sequencewith 32 bits based on Table 1 and Formula (2) in the following, and thenselect and delete 8 bits from the 32 bits, so as to obtain the codedbits sequence with 24 bits. The simplest manner is to directly deletethe last 8 bits in the 32 bits to obtain the bit sequence with 24 bits.The coded bits sequence with 32 bits may be obtained by using thefollowing formula (2):

${U_{kj} = {\left\lbrack {\sum\limits_{n = 0}^{X_{k} - 1}\left( {x_{kn} \cdot M_{j,n}} \right)} \right\rbrack{mod}\; 2}},$in which, M_(i,n) is a corresponding element in an encoding matrix, andi=0, 1, . . . , 31; X_(kn) is the n^(th) information bit in the X(k)bits to be transmitted, and n=0, . . . , X_(k)−1; and U_(kj) is thej^(th) bit in the coded bits sequence U(k).

TABLE 1 i Mi, 0 Mi, 1 Mi, 2 Mi, 3 Mi, 4 Mi, 5 Mi, 6 Mi, 7 Mi, 8 Mi, 9Mi, 10 0 1 1 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 1 1 2 1 0 0 1 0 0 1 01 1 1 3 1 0 1 1 0 0 0 0 1 0 1 4 1 1 1 1 0 0 0 1 0 0 1 5 1 1 0 0 1 0 1 11 0 1 6 1 0 1 0 1 0 1 0 1 1 1 7 1 0 0 1 1 0 0 1 1 0 1 8 1 1 0 1 1 0 0 10 1 1 9 1 0 1 1 1 0 1 0 0 1 1 10 1 0 1 0 0 1 1 1 0 1 1 11 1 1 1 0 0 1 10 1 0 1 12 1 0 0 1 0 1 0 1 1 1 1 13 1 1 0 1 0 1 0 1 0 1 1 14 1 0 0 0 1 10 1 0 0 1 15 1 1 0 0 1 1 1 1 0 1 1 16 1 1 1 0 1 1 1 0 0 1 0 17 1 0 0 1 11 0 0 1 0 0 18 1 1 0 1 1 1 1 1 0 0 0 19 1 0 0 0 0 1 1 0 0 0 0 20 1 0 1 00 0 1 0 0 0 1 21 1 1 0 1 0 0 0 0 0 1 1 22 1 0 0 0 1 0 0 1 1 0 1 23 1 1 10 1 0 0 0 1 1 1 24 1 1 1 1 1 0 1 1 1 1 0 25 1 1 0 0 0 1 1 1 0 0 1 26 1 01 1 0 1 0 0 1 1 0 27 1 1 1 1 0 1 0 1 1 1 0 28 1 0 1 0 1 1 1 0 1 0 0 29 10 1 1 1 1 1 1 1 0 0 30 1 1 1 1 1 1 1 1 1 1 1 31 1 0 0 0 0 0 0 0 0 0 0

The specific encoding methods may also both be to generate a coded bitssequence with 20 bits based on Table 2 and Formula (3) in the following,and then select 4 bits from the 20 bits and add the 4 bits behind theend of the bit sequence with 20 bits, so as to obtain the coded bitssequence with 24 bits, in which, the relative order of the added 4 bitsmay be different from the relative order of the 4 bits in the previouscoded bits sequence with 20 bits. The simplest manner is to directlyselect the first 4 bits from the 20 bits and then put the 4 bits afterthe 20 bits. The coded bits sequence with 20 bits may be obtained byusing the following formula (3):

${U_{kj} = {\left\lbrack {\sum\limits_{n = 0}^{X_{k} - 1}\left( {x_{kn} \cdot M_{j,n}} \right)} \right\rbrack{mod}\; 2}},$in which, M_(i,n) is a corresponding element in the encoding matrix, andi=0, 1, . . . , 19; x_(kn) is the n^(th) information bit in the X(k)bits to be transmitted, and n=0, . . . X_(k)−1; and U_(kj) is the j^(th)bit in the coded bits sequence U(k).

TABLE 2 i M_(i,0) M_(i,1) M_(i,2) M_(i,3) M_(i,4) M_(i,5) M_(i,6)M_(i,7) M_(i,8) M_(i,9) M_(i,10) M_(i,11) M_(i,12) 0 1 1 0 0 0 0 0 0 0 01 1 0 1 1 1 1 0 0 0 0 0 0 1 1 1 0 2 1 0 0 1 0 0 1 0 1 1 1 1 1 3 1 0 1 10 0 0 0 1 0 1 1 1 4 1 1 1 1 0 0 0 1 0 0 1 1 1 5 1 1 0 0 1 0 1 1 1 0 1 11 6 1 0 1 0 1 0 1 0 1 1 1 1 1 7 1 0 0 1 1 0 0 1 1 0 1 1 1 8 1 1 0 1 1 00 1 0 1 1 1 1 9 1 0 1 1 1 0 1 0 0 1 1 1 1 10 1 0 1 0 0 1 1 1 0 1 1 1 111 1 1 1 0 0 1 1 0 1 0 1 1 1 12 1 0 0 1 0 1 0 1 1 1 1 1 1 13 1 1 0 1 0 10 1 0 1 1 1 1 14 1 0 0 0 1 1 0 1 0 0 1 0 1 15 1 1 0 0 1 1 1 1 0 1 1 0 116 1 1 1 0 1 1 1 0 0 1 0 1 1 17 1 0 0 1 1 1 0 0 1 0 0 1 1 18 1 1 0 1 1 11 1 0 0 0 0 0 19 1 0 0 0 0 1 1 0 0 0 0 0 0

As for specific encoding methods, one group of the information bits maybe based on the method described in Table 1, and another group may bebased on the method described in Table 2. The specific encoding methodsmay also both adopt a convolutional code, and the specificimplementation of the convolutional code may adopt the implementationmanner adopted in 3GPP Universal Terrestrial Radio Access (UTRA) Release6 or 3GPP LTE Release 8, or other implementation manners, but is notlimited thereto.

The encoded coded bits of each group may also be respectively andseparately reordered. For example, the bits in U(1) are reorderedaccording to the sequence determined by the following formula (4):(Pn+1) mod 24, n=0, 1, . . . 23, in which, mod is modulo operation, P isa number which is relatively prime to 24, such as 11 and 13, and whenP=13, the sequence determined by the formula is as follows: [1, 14, 3,16, 5, 18, 7, 20, 9, 22, 11, 0, 13, 2, 15, 4, 17, 6, 19, 8, 21, 10, 23,12]; and the codeword sequence of U(1) after reordering is as follows:[U_(1.1), U_(1.14), U_(1.3), . . . , U_(1.23), U_(1.12)].

Step 303: Combine the obtained n coded bits sequences with U(i) bits toobtain a coded bit sequence with B bits in total, in which, the relativeorder between groups during combining is not limited, and may be anyorder, and then the bits in the codeword sequence B are divided intosub-groups according to a predetermined modulation manner to obtain asub-group sequence, the sub-groups in the obtained sub-group sequenceare reordered, so that the sub-groups formed by the coded bits from eachU(i) are discretely distributed in the entire sub-group sequence, andfinally, the sub-groups are ungrouped to obtain another coded bitsequence with B bits.

For example, if the modulation manner is predetermined to be the QPSKmodulation, every two coded bits make up one sub-group; if themodulation manner is predetermined to be the 16QAM, every four codedbits make up one sub-group; and so forth.

Specifically, when the DFT-S-OFDM is used, the modulation manner ispredetermined to be the QPSK modulation, and U(1)=U(2)=24, U(1) and U(2)are first combined into U(1)U(2) or U(2)U(1), and a coded bits sequenceB with 48 bits is obtained. By taking B=U(1)U(2)=[U_(1.0), U_(1.1), . .. , U_(1.23), U_(2.0), U_(2.1), . . . , U_(2.23)] as an example, B isfirst divided into sub-groups to obtain [(U_(1.0), U_(1.1)), . . . ,(U_(1.22), U_(1.23)), (U_(2.0), U_(2.1)), . . . , (U_(2.22), U_(2.23))],the sub-groups are reordered into [(U_(1.0), U_(1.1)), (U_(2.0),U_(2.1)), (U_(1.2), U_(1.3)), (U_(2.2), U_(2.3)), . . . , (U_(1.22),U_(1.23)), (U_(2.22), U_(2.23))], and finally, the sub-groups areungrouped to obtain another coded bit sequence [U_(1.0), U_(1.1),U_(2.0), U_(2.2), . . . , U_(1.22), U_(1.23), U_(2.22), U_(2.23)].

The reordering the sub-groups to enable each group of the codeword bitsto be discretely distributed in the whole coded bits sequence in theforegoing description aims to obtain better performance. By still takingB=U(1)U(2)=[U_(1.0), U_(1.1), . . . , U_(1.23), U_(2.0), U_(2.1), . . ., U_(2.23)] as an example, before reordering, if a structure similar toDFT-S-OFDM is directly used for the coded bits sequence B to transmitthe information bits, the coded bit sequence U(1) generated through theencoding of X(1) bits is finally mapped onto the slot 0 only, andlikewise, U(2) is finally mapped onto the slot 1 only. In this way, thereceiving of the X(1) bits merely depends on the channel condition ofthe slot 0, and because the channel condition of the slot 0 may be goodor bad, the receiving performance is not stable, and likewise the X(2)bits have similar problems. In another aspect, the last symbol in theslot 1 illustrated in FIG. 1 may be occupied for other use sometimes,for example, the last symbol may be used to transmit an SRS sometimes,and when such a case occurs, the extension length in the slot 1 of theDFT-S-OFDM format is shortened from the length 5 to a length 4. Theperformance of long extension length is better than the short one. Assuch, if the U(1) is mapped onto the slot 0, and the U(2) is mapped ontothe slot 1, the receiving performance of the X(1) bits is better thanthe performance of the X(2) bits on the whole, thereby causingunbalanced receiving performance. After reordering, by taking the codedbits sequence [U_(1.0), U_(1.1), U_(2.0), U_(2.2), . . . , U_(1.22),U_(1.23), U_(2.22), U_(2.23)] obtained through ordering as an example,the coded bits in the U(1) are distributed in both the slot 0 and theslot 1, and in this way, the receiving of the X(1) bits depends on thechannel conditions of the two slots at the same time. Because theprobability that the channel conditions of the two slots are bad at thesame time is small, the receiving performance of the X(1) bits is nottoo bad in most cases. Likewise, the receiving performance of the X(2)bits is also not too bad. On the other hand, when the last symbol in theslot 1 is occupied for other use, the extension length of some of X(1)and X(2) may be a length 5 or a length 4, which is fair to X(1) andX(2), thereby achieving balanced performance. Because the sub-groups arereordered, so that the coded bits of the sub-groups are distributed asdiscretely as possible and finally, the coded bits are distributed oneach of the slots, which is important for improving the receivingperformance.

Step 304: Sequentially modulate the obtained coded bits sequence with Bbits according to a predetermined modulation manner, so as to obtain aseries of modulation symbol sequences.

Specifically, the modulation manner may be QPSK modulation or 16QAM.When the QPSK modulation is used, the sequential modulation is that,b(0) and b(1) are modulated into the modulation symbol q(0), b(2) andb(3) are modulated into the modulation symbol q(1), and so forth. Whenthe 16QAM is used, the sequential modulation is that, b(0), b(1), b(2)and b(3) are modulated into the modulation symbol q(0), b(4), b(5), b(6)and b(7) are modulated into the modulation symbol q(1), and so forth.

It should be noted that, the grouping of the sub-groups in step 303 aimsto ensure that the coded bits included in each modulation symbolobtained after the modulation in step 304 are from the same encodinggroup U(i), and thus the receiving end may easily implement thesymbol-level maximum likelihood algorithm with good performance andcontrols the complexity, thereby ensuring the algorithm implementationof the receiving end and the performance. Specifically, if thereordering on the coded bits sequence is performed by using an ordinaryreordering manner without any restriction or specific requirements, thatis, every coded bit is independent, the coded bit may be placed at anylocation and has no relation with the location of adjacent coded bits,for example, the coded bits sequence obtained by using such an orderingmanner may be B=[U_(1.0), U_(2.0), U_(1.1), U_(2.1), . . . , U_(1.23),U_(2.23)], that is, the coded bits sequences in U(1) and U(2) arealternately placed together. In this case, the receiving end cannot usethe symbol-level maximum likelihood algorithm with good performance forthe sub-code groups independently, because the bits included in somemodulation symbols belong to different sub-code groups, for example, thecoded bits U_(1.0), U_(2.0) in B may be modulated into a QPSK modulationsymbol, but they come from different sub-code groups. If thesymbol-level maximum likelihood algorithm must be used, the sub-codegroups have to be jointly processed, and the complexity thereof is veryhigh. The reason lies in that the maximum likelihood algorithm generallyneeds to search for all the probabilities, and herein, the maximumlikelihood algorithm needs to search through all modulation symbolsequences, and moreover, the maximum likelihood algorithm needs tojointly search through all possible coded bits sequences in all codegroups. By taking two sub-code groups each having 10 bits as an example,the joint search needs to search 2¹⁰*2¹⁰ (more than one million)different probabilities. If virtual grouping is first performed toensure that the coded bits in each modulation symbol are from the samesub-code group, the receiving end may select all the modulation symbolsbelonging to different sub-code groups and use the symbol-level maximumlikelihood algorithm for the modulation symbols independently, therebydramatically reducing the complexity. For example, by still taking twocode groups each having 10 bits as an example, the maximum likelihoodalgorithm for the sub-code groups independently needs to search 2¹⁰+2¹⁰(about 2000) different probabilities, and the complexity thereof isdramatically reduced in comparison with the one million probabilities.

Step 305: Sequentially map the modulation symbol sequences onto astructure S, and put a pilot into the structure S for transmission.

The structure S herein refers to a structure similar to DFT-S-OFDM, thatis, the physical resources occupied by the structure occupy at least twotime periods with almost independent channel condition in time domain,and/or occupy at least two frequency bands with almost independentchannel condition in frequency domain. Specifically, when the DFT-S-OFDMis used, the mapping further includes: performing operations such as DFTand extension first, and then sequential mapping, that is, adjacentsymbols are mapped onto adjacent sub-carriers.

Correspondingly, the receiving end needs to receive the symbolsaccording to an encoding method, a modulation manner for each sub-groupand a reordering rule used by the transmitting end, including: restoringan original order according to the reordering rule and performingdemodulation and decoding, which will not be described in detail herein.The receiving end may be a base station.

For the purpose of easily observing the performance of the method fortransmitting information bits in this embodiment, the information bitsare divided into two groups in the following, which are both encodedthrough Table 1, and then are alternately ordered, and moreover, thetransmission through the DFT-S-OFDM format illustrated in FIG. 1 is usedas a representative to give the performance of this embodiment. Theperformance comparison is implemented through simulation, and thesimulation condition is as follows: 5 megahertz (MHz) bandwidth, EvolvedTypical Urban (ETU) channel, moving speed of 3 km/h of UE, architectureof 1 transmitting and two receiving antennas, and using real channelestimation.

Referring to FIG. 4, FIG. 4 is a schematic diagram of the simulationresult in the case that the number of information bits to be transmittedis 12 bits, 16 bits, and 20 bits. In FIG. 4, horizontal coordinatesrepresent a Signal-to-Noise Ratio (SNR) in the unit of dB, and verticalcoordinates represents a Bit Error Rate (BER). At this time, the smallerthe SNR required to achieve the same BER is, the better the performanceis.

An embodiment of the present invention provides a method fortransmitting information bits, and as shown in FIG. 5, the methodincludes the following steps:

Step 501: A transmitting end first divides A information bits to betransmitted into n groups (n≧2), in which each group includes X(n) bits,and X(1)+X(2)+ . . . +X(n)=A. Each group may have a same or differentnumber of bits in this step. For example, 20 information bits are to betransmitted, which may be divided into two parts each having 10 bits,that is, X(1)=X(2)=10. Specifically, the transmitting end may beLTE/LTE-A UE, and the information bits to be transmitted are uplinkcontrol information bits which include but are not limited to a CQIand/or a PMI and/or an RI and/or ACK/NACK information and/or an SRI.

In this step, the dividing A information bits may also include thefollowing sub-steps. When the A information bits include controlinformation bits of different types, the A information bits may begrouped by the types of the control information, that is, the bits ofdifferent types may be put in different groups. Because the receivingperformance required by the control information bits of different typesis not totally the same, the control information bits of different typesmay be separately encoded. For example, the CQI information bits in theA information bits are put in one group, and the ACK/NACK information isput in another group; or the SRI information bits in the A informationbits are put in one group, and the ACK/NACK information is put inanother group; or the CQI information bits in the A information bits areput in one group, and the SRI information is put in another group.Specifically, for example, if 16 information bits include 10 CQI bitsand 6 ACK/NACK bits, the 10 CQI bits are separately defined as a group,and the 6 ACK/NACK bits are separately defined as a group.

In this step, the dividing A information bits may also include thefollowing sub-steps. When the A information bits include a plurality ofcarrier CQIs, the A information bits may be grouped by carriers, thatis, the CQIs of different carriers may be put in different groups. Forexample, if 17 information bits include 11 CQI bits of the carrier 1 and6 CQI bits of the carrier 2, the 11 CQI bits of the carrier 1 are put inone group, and the 6 CQI bits of the carrier 2 are put in another group.

In this step, the dividing A information bits may also include thefollowing sub-steps. When the A information bits include the CQI, theACK/NACK and the SRI, the information bits corresponding to the ACK/NACKand the SRI are put in one group, the information bits corresponding tothe CQI are put in another group; or the information bits correspondingto the CQI and the SRI are put in one group, and the information bitscorresponding to the ACK/NACK are put in another group. For example, if18 information bits include 11 CQI bits, 6 ACK/NACK information bits and1 SRI information bit, the 11 CQI bits are put in one group, and the 6ACK/NACK information bits and the 1 SRI information bit are put inanother group.

Step 502: Encode the X(k) bits by using an encoding method k to generateU(k) coded bits sequences, in which U(1)+U(2)+ . . . +U(n)=B, B is thetotal number of coded bits, and U(k) is an integral multiple of thenumber of bits that is represented by one modulation symbol in apredetermined modulation manner. Whether the encoding methods i, j arethe same is not limited.

For example, if the modulation manner is set to be QPSK modulation, thenumber of bits included in each U(k) is a multiple of 2; if themodulation manner is set to be 16QAM, the number of bits included ineach U(k) is a multiple of 4; and so forth. The specific encoding methodis similar to Step 302 in FIG. 3, so that the details will not bedescribed herein again.

Step 503: Combine all the obtained U(i) to obtain a coded bits sequencewith B bits.

In the combining method of this step, the relative order between groupsduring combining is not limited, and may be any order. For example, theU(i) may be combined in an ascending or descending order of the value ofi. For example, if two coded bits sequences are generated in Step 503,the U(i) may be combined according to the order of first U1 and then U2,or according to the order of first U2 and then U1.

Step 504: Sequentially modulate the obtained coded bits sequence with Bbits according to a predetermined modulation manner, so as to obtain aseries of modulation symbol sequences.

Specifically, the modulation manner may be QPSK modulation or 16QAM.When the QPSK modulation is used, the sequential modulation is that,b(0) and b(1) are modulated into the modulation symbol q(0), b(2) andb(3) are modulated into the modulation symbol q(1), and so forth. Whenthe 16QAM is used, the sequential modulation is that, b(0), b(1), b(2)and b(3) are modulated into the modulation symbol q(0), b(4), b(5), b(6)and b(7) are modulated into the modulation symbol q(1), and so forth.

Step 505: Reorder the obtained modulation symbols, so that themodulation symbols from a same coded bits sequence are discretelydistributed in the entire modulation symbol sequence.

Specifically, when U(1)=U(2)=24, after using the QPSK modulation, theU(1) generates [q_(1.0), q_(1.1), . . . , q_(1.11)] and U(2) generates[q_(2.0), q_(2.1), . . . , q_(2.11)], and the modulation symbols areordered to obtain a modulation symbol sequence Q with the length 24. Forexample, the modulation symbol sequence Q obtained after reordering maybe shown in the following, in which not all the orders can be describedthrough a formula or a rule, and can only be reflected through the finalresult. The orders are as follows: the first order: Q≦[q_(1.0), q_(2.0),q_(1.1), q_(2.1), . . . , q_(1.11), q_(2.11)]; the second order:Q=[q_(1.0), q_(1.1), . . . , q_(1.5), q_(2.0), q_(2.1), . . . , q_(2.5),q_(1.6), q_(1.7), . . . , q_(1.11), q_(2.6), q_(2.7), . . . , q_(2.11)];and the third order: Q=[q_(1.0), q_(1.1), q_(2.0), q_(2.1), q_(1.2),q_(1.3), q_(2.2), q_(2.3), . . . , q_(1.10), q_(1.11), q_(2.10), . . .q_(2.11)].

The modulation symbol sequence with the length 24 [q_(1.0), q_(1.1), . .. , q_(1.11), q_(2.0), q_(2.1), . . . , q_(2.11)] may also be reorderedaccording to the sequence determined by the following formula (5):(Pn+1)mod 24, n=0, 1, . . . , 23, in which, mod is modulo operation, Pis a number which is relatively prime to 24, such as 11 and 13; and whenP=13, the sequence determined by the formula is as follows: [1, 14, 3,16, 5, 18, 7, 20, 9, 22, 11, 0, 13, 2, 15, 4, 17, 6, 19, 8, 21, 10, 23,12]; and the modulation symbol sequence after reordering is as follows:[q_(1.1), q_(2.2), q_(1.3), q_(2.4), q_(1.5), q_(2.6), q_(1.7), . . . ,q_(1.10), q_(2.11), q_(2.0)].

The objective of reordering is the same as the description of Step 303in FIG. 3, so that the details will not be described herein again. Itshould be noted that, the foregoing description is merely some examplesof the ordering manners, and the present invention does not limit thespecific ordering manners.

Step 506: Sequentially map the modulation symbol sequences onto astructure S, and put a pilot into the structure S for transmission.

Specifically, when the DFT-S-OFDM is used, the mapping further includesoperations such as spreading and DFT, followed by sequential mapping.

Correspondingly, the receiving end needs to receive the symbolsaccording to an encoding method, a modulation manner and a reorderingrule used for each sub-group by the transmitting end, including:restoring an original order according to the reordering rule andperforming demodulation and decoding, which will not be described indetail herein. The receiving end may be a base station.

For the purpose of easily observing the performance of the method fortransmitting information bits in this embodiment, the information bitsare divided into two groups in the following, which are both encodedthrough Table 1, and then the modulation symbols are alternatelyordered, and moreover, the transmission through the DFT-S-OFDM formatillustrated in FIG. 1 is used as a representative to give theperformance of this embodiment. The performance comparison isimplemented through simulation, and the simulation condition is asfollows: 5 MHz bandwidth, ETU channel, moving speed of 3 km/h of UE,architecture of 1 transmitting and two receiving antennas, and usingreal channel estimation. Referring to FIG. 6, FIG. 6 is a schematicdiagram of the simulation result in the case that the number ofinformation bits to be transmitted is 12 bits, 16 bits, and 20 bits. InFIG. 6, horizontal coordinates represent an SNR in the unit of dB, andvertical coordinates represent a BER. At this time, the smaller the SNRrequired to achieve the same BER is, the better the performance is.

An embodiment of the present invention provides an apparatus fortransmitting information bits, and as shown in FIG. 7, the apparatusincludes: a grouping unit 701, configured to divide information bits tobe transmitted into at least two groups; an encoding unit 702,configured to encode the information bits to be transmitted in eachgroup; a modulating unit 703, configured to modulate the encoded codedbits to obtain modulation symbols, in which each modulation symbol isobtained by using the modulation of the coded bits in the same group;and a mapping and transmitting unit 704, configured to map and transmitthe modulation symbols.

In the grouping unit 701, each group may have a same or different numberof information bits. In addition, the information bits to be transmittedinclude at least one of the following uplink control information bits: aCQI, a PMI, an RI, ACK/NACK information and an SRI.

The specific structure of the modulating unit 703 is shown in FIG. 8,which includes: a first sub-group unit 7031, configured to divide theencoded coded bits in each group into N sub-groups to obtain a codedbits sub-group sequence of each group; a combining unit 7032, configuredto combine the coded bits sub-group sequence of each group to obtain atotal coded bits sub-group sequence; an ordering unit 7033, configuredto reorder the total coded bits sub-group sequence, so that the codedbits sub-group sequence of at least one group is discontinuouslydistributed in the total coded bits sub-group sequence; and a firstmodulating unit 7034, configured to modulate the reordered total codedbits sub-group sequence to obtain modulation symbols. As for thespecific implementation of the first sub-group unit 7031, the combiningunit 7032, the ordering unit 7033 and the first modulating unit 7034,reference may be made to step 302, so that the details will not bedescribed herein again.

The ordering unit 7033 further includes: a first ordering unit (notshown), configured to alternately order the coded bits sub-groupsequence of each group in the total coded bits sub-group sequence, andas for the specific implementation, reference may be made to step 302,so that the details are not described herein again.

Referring to FIG. 9, the modulation unit 703 may include: a secondmodulating unit 7131, configured to modulate the encoded coded bits ofeach group to obtain the modulation symbols of each group; a secondcombining unit 7132, configured to combine the modulation symbols ofeach group to obtain a modulation symbol sequence; and a second orderingunit 7133, configured to reorder the modulation symbol sequence, so thatat least one group of the modulation symbols is discontinuouslydistributed in the modulation symbol sequence. As for the specificimplementation of the second modulating unit 7131, the second combiningunit 7132 and the second ordering unit 7133, reference may be made tosteps 503, 504 and 505, so that the details will not be described hereinagain.

The second ordering unit 7133 includes: a third ordering unit (notshown), configured to alternately order the modulation symbols of eachgroup in the modulation symbol sequence, and as for the specificimplementation manner, reference may be made to step 505, so that thedetails will not be described herein again.

An embodiment of the present invention further provides a system fortransmitting information bits, which includes a terminal and a basestation in communication with the terminal, in which, the terminal isconfigured to divide the information bits to be transmitted into atleast two groups, encode the information bits to be transmitted in eachgroup, modulate the encoded coded bits to obtain modulation symbols, inwhich each modulation symbol is obtained by using the modulation of thecoded bits in the same group, and map and transmit the modulationsymbols to the base station; and the base station is configured toreceive the modulation symbols transmitted by the terminal, anddemodulate and decode the modulation symbols to obtain the informationbits to be transmitted.

It is clear to persons skilled in the art that the present invention maybe accomplished through software plus a necessary universal hardwareplatform. Based on this, the above technical solutions or the part thatmakes contributions to the prior art can be substantially embodied inthe form of a software product. The computer software product may bestored in a storage medium such as a read-only memory(ROM)/random-access memory (RAM), a magnetic disk, or an optical disk,and contain several instructions to instruct computer equipment (forexample, a personal computer, a server, or network equipment) to performthe methods described in the embodiments of the present invention or insome parts of the embodiments of the present invention.

The above descriptions are merely specific embodiments of the presentinvention, but not intended to limit the protection scope of the presentinvention. Any variations or replacements that can be easily thought ofby persons skilled in the art within the technical scope of the presentinvention shall fall within the protection scope of the presentinvention as defined by the appended claims.

What is claimed is:
 1. A method for transmitting information bits,comprising: dividing information bits to be transmitted into a firstgroup and a second group; encoding the information bits in the firstgroup to obtain a first group of coded bits and the information bits inthe second group to obtain a second group of coded bits; dividing thefirst group of coded bits and the second group of coded bits into Nsub-groups respectively, wherein each of the sub-groups includes twocoded bits; alternately selecting the sub-groups in the first group ofcoded bits and the second group of coded bits to obtain a total codedbits sequence; modulating the total coded bits sequence to obtainmodulation symbols, wherein each of the modulation symbols is obtainedby a modulation of the coded bits in the same sub-group; and mapping andtransmitting the modulation symbols, wherein N is an integer greaterthan or equal to two.
 2. The method according to claim 1, wherein theinformation bits to be transmitted comprise at least one of thefollowing uplink control information bits: a Channel Quality Indicator(CQI), a Precoding Matrix Index (PMI), a Rank Indicator (RI),Acknowledged/non-acknowledged (ACK/NACK) information, and a SchedulingRequest Indicator (SRI).
 3. The method according to claim 1, wherein thenumber of the information bits in the first group is same as the numberof the information bits in the second group.
 4. An apparatus fortransmitting information bits, comprising: a grouping unit, configuredto divide information bits to be transmitted into a first group and asecond group; an encoding unit, configured to encode the informationbits in the first group to obtain a first group of coded bits and theinformation bits in the second group to obtain a second group of codedbits; a sub-group unit, configured to divide the first group of codedbits and the second group of coded bits into N sub-groups respectively,wherein each of the sub-groups includes two coded bits; an orderingunit, configured to alternately select the sub-groups in the first groupof coded bits and the second group of coded bits to obtain a total codedbits sequence; a modulating unit, configured to modulate the total codedbits sequence to obtain modulation symbols, wherein each of themodulation symbols is obtained by a modulation of the coded bits in thesame sub-group; and a mapping and transmitting unit, configured to mapand transmit the modulation symbols, wherein N is an integer greaterthan or equal to two.
 5. The apparatus according to claim 4, wherein theinformation bits to be transmitted comprise at least one of thefollowing uplink control information bits: a Channel Quality Indicator(CQI), a Precoding Matrix Index (PMI), a Rank Indicator (RI),Acknowledged/non-acknowledged (ACK/NACK) information, and a SchedulingRequest Indicator (SRI).
 6. The apparatus according to claim 4, whereinthe number of the information bits in the first group is same as thenumber of the information bits in the second group.
 7. A terminal,comprising: a processor, configured to divide information bits to betransmitted into a first group and a second group, encode theinformation bits in the first group to obtain a first group of codedbits and the information bits in the second group to obtain a secondgroup of coded bits, divide the first group of coded bits and secondgroup of coded bits into N sub-groups respectively, wherein each of thesub-groups includes two coded bits, alternately select the sub-groups inthe first group of coded bits and the second group of coded bits toobtain a total coded bits sequence, modulate the total coded bitssequence to obtain modulation symbols, and map the modulation symbols,wherein each of the modulation symbols is obtained by a modulation ofthe coded bits in the same sub-group; and a transmitter, configured totransmit the mapped modulation symbols, wherein N is an integer greaterthan or equal to two.
 8. The terminal according to claim 7, wherein theinformation bits to be transmitted comprise at least one of thefollowing uplink control information bits: a Channel Quality Indicator(CQI), a Precoding Matrix Index (PMI), a Rank Indicator (RI),Acknowledged/non-acknowledged (ACK/NACK) information, and a SchedulingRequest Indicator (SRI).
 9. The terminal according to claim 7, whereinthe number of the information bits in the first group is same as thenumber of the information bits in the second group.